On Tree Pattern Constraints for XML Documents
نویسندگان
چکیده
In this paper, we introduce the concept of tree pattern constraints (XTPCs) for XML documents as a pattern-based schema formalism founded on XPath. XTPCs provide an effective means to specify conditions on path or tree patterns that XML documents have to satisfy. Conditions include implication, absence, and co-occurrence of patterns. XTPCs can be used as stand-alone schema formalisms or in conjunction with a DTD or XML Schema. We study in detail the (bounded) implication and consistency problems for XTPCs, give a sound and complete axiomatization as well as complexity results. If used in conjunction with a DTD, we study the consistency problem for XTPCs in the presence of DTDs.
منابع مشابه
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chemical compounds, protein structures, XML and Web log databases and social networks, require much more sophisticated data structures such as trees and graphs. In these contexts, interesting patterns involve not only freq...
متن کاملConstraint-based Tree Pattern Mining
Most work on pattern mining focus on simple data structures like itemsets or sequences of itemsets. However, a lot of recent applications dealing with complex data like chemical compounds, protein structure, XML and Web Log databases, social network, require much more sophisticated data structures (trees or graphs) for their specification. Here, interesting patterns involve not only frequent ob...
متن کاملPreserving Constraints for Aggregation Relationship Type Update in XML Document
Despite the increasing demand for effective XML document repository, many are still reluctant to store XML documents in their natural tree form. One main reason is the limitation of XML languages used to define and manipulate the XML documents. It is evident that the current XML languages have lack of support for update operations. Even though some of the languages have supported minimum update...
متن کاملTree Automata to Verify XML Key Constraints
We address the problem of checking key constraints in XML. Key constraints have been recently considered in the literature and some of their aspects are adopted in XMLSchema. However, only few works have appeared concerning the verification of such constraints. Unranked deterministic bottom-up tree automata can be used to validate XML documents against a schema. These automata work over (unrank...
متن کاملFragmenting XML Documents via Structural Constraints
XML query processors suffer from main-memory limitations that prevent them from processing large XML documents. While content-based predicates can be used to project down parts of the documents, it may still be needed to resize the obtained projections according to structural constraints. In this paper, we consider size, tree-width and tree-depth constraints to enable a structuredriven fragment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003